Coarsening phase Uncoarsening

نویسنده

  • François Pellegrini
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Serial and Parallel Multilevel Graph Partitioning Using Fixed Centers

We present new serial and parallel algorithms for multilevel graph partitioning. Our algorithm has coarsening, partitioning and uncoarsening phases like other multilevel partitioning methods. However, we choose fixed nodes which are at least a specified distance away from each other and coarsen them with their neighbor nodes in the coarsening phase using various heuristics. Using this algorithm...

متن کامل

A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization

The unconstrained binary quadratic programming (UBQP) problem is a general NP-hard problem with various applications. In this paper, we present a multilevel algorithm designed to approximate large UBQP instances. The proposed multilevel algorithm is composed of a backbone-based coarsening phase, an asymmetric uncoarsening phase and a memetic refinement phase, where the backbone-based procedure ...

متن کامل

A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm

In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm, that is particularly suited for high latency message-passing libraries. The multilevel k-way partitioning algorithm reduces the size of the graph by collapsing vertices and edges (coarsening phase), finds a k-way partitioning of the smaller graph, and then it constructs a k-way partitioning for t...

متن کامل

Efficient and scalable parallel graph partitioning

The realization of efficient parallel graph partitioners requires the parallelization of the multi-level framework which is commonly used to improve the quality and speed of sequential partitioners. The two most critical issues in this framework are the coarsening phase, and the local refinement step performed in the uncoarsening phase. These two phases are difficult to parallelize, because the...

متن کامل

Evolutionary n-level Hypergraph Partitioning with Adaptive Coarsening

Hypergraph partitioning is an NP-hard problem that occurs in many computer science applications where it is necessary to reduce large problems into a number of smaller, computationally tractable sub-problems, with the consequent desire that these should be as independent as possible to reduce the inevitable side-effects of not taking a global approach. Current techniques use a multilevel approa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007